Uses of Interface
edu.uci.ics.jung.graph.Graph

Packages that use Graph

Package	Description
edu.uci.ics.jung.algorithms.cluster
edu.uci.ics.jung.algorithms.scoring
edu.uci.ics.jung.graph

Uses of Graph in edu.uci.ics.jung.algorithms.cluster

Methods in edu.uci.ics.jung.algorithms.cluster with parameters of type Graph

Modifier and Type	Method	Description
java.util.Set<java.util.Set<V>>	EdgeBetweennessClusterer.apply(Graph<V,E> graph)	Finds the set of clusters which have the strongest "community structure".
java.util.Set<java.util.Set<V>>	WeakComponentClusterer.apply(Graph<V,E> graph)	Extracts the weak components from a graph.

Uses of Graph in edu.uci.ics.jung.algorithms.scoring

Fields in edu.uci.ics.jung.algorithms.scoring declared as Graph

Modifier and Type	Field	Description
protected Graph<V,E>	BetweennessCentrality.graph

Methods in edu.uci.ics.jung.algorithms.scoring with parameters of type Graph

Modifier and Type	Method	Description
protected void	BetweennessCentrality.initialize(Graph<V,E> graph)

Constructors in edu.uci.ics.jung.algorithms.scoring with parameters of type Graph

Constructor	Description
BetweennessCentrality(Graph<V,E> graph)	Calculates betweenness scores based on the all-pairs unweighted shortest paths in the graph.
BetweennessCentrality(Graph<V,E> graph, Function<? super E,? extends java.lang.Number> edge_weights)	Calculates betweenness scores based on the all-pairs weighted shortest paths in the graph.

Uses of Graph in edu.uci.ics.jung.graph

Subinterfaces of Graph in edu.uci.ics.jung.graph

Modifier and Type	Interface	Description
interface	UndirectedGraph<V,E>	A tagging interface for extensions of Graph that accept only undirected edges.

Classes in edu.uci.ics.jung.graph that implement Graph

Modifier and Type	Class	Description
class	AbstractGraph<V,E>	Abstract implementation of the Graph interface.
class	AbstractTypedGraph<V,E>	An abstract class for graphs whose edges all have the same EdgeType.
class	SparseGraph<V,E>	An implementation of Graph that is suitable for sparse graphs and permits both directed and undirected edges.
class	UndirectedSparseGraph<V,E>	An implementation of UndirectedGraph that is suitable for sparse graphs.